On Natural Non-dcpo Domains
نویسنده
چکیده
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily sequential functionals is not ω-complete and therefore not continuous in the traditional terminology (in contrast to the old fully abstract continuous dcpo model of Milner). This is also applicable to a wider class of models such as the recently constructed by the author fully abstract (universal) model for PCF = PCF+parallel if. Here we will present an outline of a general approach to this kind of “natural” domains which, although being non-dcpos, allow considering “naturally” continuous functions (with respect to existing directed “pointwise”, or “natural” least upper bounds) and also have appropriate version of “naturally” algebraic and “naturally” bounded complete “natural” domains. This is the non-dcpo analogue of the wellknown concept of Scott domains, or equivalently, the complete f-spaces of Ershov. In fact, the latter version of natural domains, if considered under “natural” Scott topology, exactly corresponds to the class of f-spaces, not necessarily complete.
منابع مشابه
Natural non-dcpo domains and f-spaces
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily-sequential functionals is not ω-complete (in contrast to the old fully abstract continuous dcpo model of Milner). This is also applicable to a potentially wider class of models such as the recently constructed by the author fully abstract (universal) model for PCF = PCF + pif (parallel if). Here we will present ...
متن کاملFrom Sazonov's Non-Dcpo Natural Domains to Closed Directed-Lub Partial Orders
Normann proved that the domains of the game model of PCF (the domains of sequential functionals) need not be dcpos. Sazonov has defined natural domains for a theory of such incomplete domains. This paper further develops that theory. It defines lub-rules that infer natural lubs from existing natural lubs, and lub-rule classes that describe axiom systems like that of natural domains. There is a ...
متن کاملClausal Logic and Logic Programming in Algebraic Domains
We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and pro...
متن کاملA note on the problem when FS-domains coincide with RB-domains
In this paper, we introduce the notion of super finitely separating functions which gives a characterization of RB-domains. Then we prove that FS-domains and RB-domains are equivalent in some special cases by the following three claims: a dcpo is an RB-domain if and only if there exists an approximate identity for it consisting of super finitely separating functions; a consistent join-semilatti...
متن کاملPresenting Dcpos and Dcpo Algebras
Dcpos can be presented by a preorder of generators and inequational relations expressed as covers. Algebraic operations on the generators (possibly with their results being ideals of generators) can be extended to the dcpo presented, provided the covers are “stable” for the operations. The resulting dcpo algebra has a natural universal characterization and satisfies all the inequational laws sa...
متن کامل